Scheduling of Compute-Intensive Code Generated from Event-B Models: An Empirical Efficiency Study

Event-B is a tool-supported speci cation language that can be used e.g. for modelling of concurrent programs. This calls for code generation and a means of executing the resulting code. One approach is to preserve the original event-based nature of the model and use a runtime scheduler and message passing to execute the translated events on di erent computational nodes. In this paper, we consider the e ciency of such a solution when applied to a compute-intensive model. In order to mitigate overhead, we also use a method allowing computational nodes to repeat event execution without the involvement of the scheduler. To nd out under what circumstances the approach performs most e ciently, we perform an empirical study with di erent parameters.